- bounding element
- Строительство: граничный элемент, краевой элемент
Универсальный англо-русский словарь. Академик.ру. 2011.
bounding element
Смотреть что такое "bounding element" в других словарях:
Bounding overwatch — Bounding overwatch, also known as leapfrogging or simply bounding, is the military tactic of alternating movement of coordinated units to allow, if necessary, suppressive fire in support of offensive forward movement or defensive disengagement.… … Wikipedia
Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful … Wikipedia
Minimum bounding rectangle — The minimum bounding rectangle (MBR), also known as bounding box or envelope, is an expression of the maximum extents of a 2 dimensional object (e.g. point, line, polygon) within its 2 D (x, y) coordinate system, in other words min(x), max(x),… … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
Polytope — Not to be confused with polytrope. In elementary geometry, a polytope is a geometric object with flat sides, which exists in any general number of dimensions. A polygon is a polytope in two dimensions, a polyhedron in three dimensions, and so on… … Wikipedia
Massey product — The Massey product is an algebraic generalization of the phenomenon of Borromean rings. In algebraic topology, the Massey product is a cohomology operation of higher order introduced in (Massey 1958), which generalizes the cup product … Wikipedia
Generics in Java — Generics are a facility of generic programming that was added to the Java programming language in 2004 as part of J2SE 5.0. They allow a type or method to operate on objects of various types while providing compile time type safety. [… … Wikipedia
Collision detection — For collision detection on networks see CSMA/CD Collision detection typically refers to the computational problem of detecting the intersection of two or more objects. While the topic is most often associated with its use in video games and other … Wikipedia
Green's function — In mathematics, Green s function is a type of function used to solve inhomogeneous differential equations subject to boundary conditions. The term is used in physics, specifically in quantum field theory and statistical field theory, to refer to… … Wikipedia
Definition — For other uses, see Definition (disambiguation). A definition is a passage that explains the meaning of a term (a word, phrase or other set of symbols), or a type of thing. The term to be defined is the definiendum. A term may have many different … Wikipedia
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
